Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

app2(not, app2(not, x)) -> x
app2(not, app2(app2(or, x), y)) -> app2(app2(and, app2(not, x)), app2(not, y))
app2(not, app2(app2(and, x), y)) -> app2(app2(or, app2(not, x)), app2(not, y))
app2(app2(and, x), app2(app2(or, y), z)) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
app2(app2(and, app2(app2(or, y), z)), x) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

app2(not, app2(not, x)) -> x
app2(not, app2(app2(or, x), y)) -> app2(app2(and, app2(not, x)), app2(not, y))
app2(not, app2(app2(and, x), y)) -> app2(app2(or, app2(not, x)), app2(not, y))
app2(app2(and, x), app2(app2(or, y), z)) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
app2(app2(and, app2(app2(or, y), z)), x) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

APP2(app2(and, app2(app2(or, y), z)), x) -> APP2(app2(and, x), z)
APP2(not, app2(app2(or, x), y)) -> APP2(not, y)
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(app2(app2(filter2, app2(f, x)), f), x)
APP2(app2(and, app2(app2(or, y), z)), x) -> APP2(app2(and, x), y)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
APP2(app2(and, x), app2(app2(or, y), z)) -> APP2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
APP2(not, app2(app2(or, x), y)) -> APP2(app2(and, app2(not, x)), app2(not, y))
APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(app2(cons, x), app2(app2(filter, f), xs))
APP2(app2(and, x), app2(app2(or, y), z)) -> APP2(or, app2(app2(and, x), y))
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(filter2, app2(f, x))
APP2(not, app2(app2(and, x), y)) -> APP2(not, x)
APP2(not, app2(app2(and, x), y)) -> APP2(not, y)
APP2(app2(and, x), app2(app2(or, y), z)) -> APP2(app2(and, x), z)
APP2(app2(and, x), app2(app2(or, y), z)) -> APP2(app2(and, x), y)
APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(app2(filter2, app2(f, x)), f)
APP2(app2(app2(app2(filter2, false), f), x), xs) -> APP2(filter, f)
APP2(app2(and, app2(app2(or, y), z)), x) -> APP2(and, x)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(map, f), xs)
APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(filter, f)
APP2(not, app2(app2(or, x), y)) -> APP2(not, x)
APP2(not, app2(app2(and, x), y)) -> APP2(or, app2(not, x))
APP2(not, app2(app2(or, x), y)) -> APP2(and, app2(not, x))
APP2(app2(and, app2(app2(or, y), z)), x) -> APP2(or, app2(app2(and, x), y))
APP2(app2(and, app2(app2(or, y), z)), x) -> APP2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(cons, x)
APP2(not, app2(app2(and, x), y)) -> APP2(app2(or, app2(not, x)), app2(not, y))
APP2(app2(app2(app2(filter2, false), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(cons, app2(f, x))

The TRS R consists of the following rules:

app2(not, app2(not, x)) -> x
app2(not, app2(app2(or, x), y)) -> app2(app2(and, app2(not, x)), app2(not, y))
app2(not, app2(app2(and, x), y)) -> app2(app2(or, app2(not, x)), app2(not, y))
app2(app2(and, x), app2(app2(or, y), z)) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
app2(app2(and, app2(app2(or, y), z)), x) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(and, app2(app2(or, y), z)), x) -> APP2(app2(and, x), z)
APP2(not, app2(app2(or, x), y)) -> APP2(not, y)
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(app2(app2(filter2, app2(f, x)), f), x)
APP2(app2(and, app2(app2(or, y), z)), x) -> APP2(app2(and, x), y)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
APP2(app2(and, x), app2(app2(or, y), z)) -> APP2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
APP2(not, app2(app2(or, x), y)) -> APP2(app2(and, app2(not, x)), app2(not, y))
APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(app2(cons, x), app2(app2(filter, f), xs))
APP2(app2(and, x), app2(app2(or, y), z)) -> APP2(or, app2(app2(and, x), y))
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(filter2, app2(f, x))
APP2(not, app2(app2(and, x), y)) -> APP2(not, x)
APP2(not, app2(app2(and, x), y)) -> APP2(not, y)
APP2(app2(and, x), app2(app2(or, y), z)) -> APP2(app2(and, x), z)
APP2(app2(and, x), app2(app2(or, y), z)) -> APP2(app2(and, x), y)
APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(app2(filter2, app2(f, x)), f)
APP2(app2(app2(app2(filter2, false), f), x), xs) -> APP2(filter, f)
APP2(app2(and, app2(app2(or, y), z)), x) -> APP2(and, x)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(map, f), xs)
APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(filter, f)
APP2(not, app2(app2(or, x), y)) -> APP2(not, x)
APP2(not, app2(app2(and, x), y)) -> APP2(or, app2(not, x))
APP2(not, app2(app2(or, x), y)) -> APP2(and, app2(not, x))
APP2(app2(and, app2(app2(or, y), z)), x) -> APP2(or, app2(app2(and, x), y))
APP2(app2(and, app2(app2(or, y), z)), x) -> APP2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(cons, x)
APP2(not, app2(app2(and, x), y)) -> APP2(app2(or, app2(not, x)), app2(not, y))
APP2(app2(app2(app2(filter2, false), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(cons, app2(f, x))

The TRS R consists of the following rules:

app2(not, app2(not, x)) -> x
app2(not, app2(app2(or, x), y)) -> app2(app2(and, app2(not, x)), app2(not, y))
app2(not, app2(app2(and, x), y)) -> app2(app2(or, app2(not, x)), app2(not, y))
app2(app2(and, x), app2(app2(or, y), z)) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
app2(app2(and, app2(app2(or, y), z)), x) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 3 SCCs with 18 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(and, app2(app2(or, y), z)), x) -> APP2(app2(and, x), z)
APP2(app2(and, app2(app2(or, y), z)), x) -> APP2(app2(and, x), y)
APP2(app2(and, x), app2(app2(or, y), z)) -> APP2(app2(and, x), y)
APP2(app2(and, x), app2(app2(or, y), z)) -> APP2(app2(and, x), z)

The TRS R consists of the following rules:

app2(not, app2(not, x)) -> x
app2(not, app2(app2(or, x), y)) -> app2(app2(and, app2(not, x)), app2(not, y))
app2(not, app2(app2(and, x), y)) -> app2(app2(or, app2(not, x)), app2(not, y))
app2(app2(and, x), app2(app2(or, y), z)) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
app2(app2(and, app2(app2(or, y), z)), x) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


APP2(app2(and, app2(app2(or, y), z)), x) -> APP2(app2(and, x), z)
APP2(app2(and, app2(app2(or, y), z)), x) -> APP2(app2(and, x), y)
APP2(app2(and, x), app2(app2(or, y), z)) -> APP2(app2(and, x), y)
APP2(app2(and, x), app2(app2(or, y), z)) -> APP2(app2(and, x), z)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( or ) = 1


POL( APP2(x1, x2) ) = x1 + x2 + 1


POL( and ) = max{0, -1}


POL( app2(x1, x2) ) = x1 + x2



The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof
          ↳ QDP
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app2(not, app2(not, x)) -> x
app2(not, app2(app2(or, x), y)) -> app2(app2(and, app2(not, x)), app2(not, y))
app2(not, app2(app2(and, x), y)) -> app2(app2(or, app2(not, x)), app2(not, y))
app2(app2(and, x), app2(app2(or, y), z)) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
app2(app2(and, app2(app2(or, y), z)), x) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP2(not, app2(app2(or, x), y)) -> APP2(not, x)
APP2(not, app2(app2(or, x), y)) -> APP2(not, y)
APP2(not, app2(app2(and, x), y)) -> APP2(not, x)
APP2(not, app2(app2(and, x), y)) -> APP2(not, y)

The TRS R consists of the following rules:

app2(not, app2(not, x)) -> x
app2(not, app2(app2(or, x), y)) -> app2(app2(and, app2(not, x)), app2(not, y))
app2(not, app2(app2(and, x), y)) -> app2(app2(or, app2(not, x)), app2(not, y))
app2(app2(and, x), app2(app2(or, y), z)) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
app2(app2(and, app2(app2(or, y), z)), x) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


APP2(not, app2(app2(or, x), y)) -> APP2(not, x)
APP2(not, app2(app2(or, x), y)) -> APP2(not, y)
APP2(not, app2(app2(and, x), y)) -> APP2(not, x)
APP2(not, app2(app2(and, x), y)) -> APP2(not, y)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( or ) = 1


POL( APP2(x1, x2) ) = x1 + x2 + 1


POL( not ) = 1


POL( and ) = 1


POL( app2(x1, x2) ) = x1 + x2



The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app2(not, app2(not, x)) -> x
app2(not, app2(app2(or, x), y)) -> app2(app2(and, app2(not, x)), app2(not, y))
app2(not, app2(app2(and, x), y)) -> app2(app2(or, app2(not, x)), app2(not, y))
app2(app2(and, x), app2(app2(or, y), z)) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
app2(app2(and, app2(app2(or, y), z)), x) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
APP2(app2(app2(app2(filter2, false), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(map, f), xs)

The TRS R consists of the following rules:

app2(not, app2(not, x)) -> x
app2(not, app2(app2(or, x), y)) -> app2(app2(and, app2(not, x)), app2(not, y))
app2(not, app2(app2(and, x), y)) -> app2(app2(or, app2(not, x)), app2(not, y))
app2(app2(and, x), app2(app2(or, y), z)) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
app2(app2(and, app2(app2(or, y), z)), x) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(map, f), xs)
The remaining pairs can at least be oriented weakly.

APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(app2(app2(app2(filter2, false), f), x), xs) -> APP2(app2(filter, f), xs)
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( filter ) = 1


POL( true ) = 0


POL( not ) = 0


POL( map ) = max{0, -1}


POL( false ) = 1


POL( app2(x1, x2) ) = x1 + x2 + 1


POL( or ) = 1


POL( APP2(x1, x2) ) = x2 + 1


POL( filter2 ) = 1


POL( and ) = 0


POL( nil ) = max{0, -1}


POL( cons ) = 1



The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(app2(app2(app2(filter2, false), f), x), xs) -> APP2(app2(filter, f), xs)

The TRS R consists of the following rules:

app2(not, app2(not, x)) -> x
app2(not, app2(app2(or, x), y)) -> app2(app2(and, app2(not, x)), app2(not, y))
app2(not, app2(app2(and, x), y)) -> app2(app2(or, app2(not, x)), app2(not, y))
app2(app2(and, x), app2(app2(or, y), z)) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
app2(app2(and, app2(app2(or, y), z)), x) -> app2(app2(or, app2(app2(and, x), y)), app2(app2(and, x), z))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 0 SCCs with 2 less nodes.